λ¬Έμ
Programmers - νΈν λ°© λ°°μ
π Logic
private long getRoom(long room) {
// ν΄λΉ λ°©μ΄ μμ§ λ°°μ λ°μ§ μμ κ²½μ°
if (!roomMap.containsKey(room)) {
roomMap.put(room, room + 1);
return room;
}
// ν΄λΉ λ°©μ΄ μ΄λ―Έ λ°°μ λ κ²½μ°, μ¬κ· νΈμΆμ ν΅ν΄ λΉ λ°©μ μ°Ύλλ€.
long emptyRoom = getRoom(roomMap.get(room));
roomMap.put(room, emptyRoom);
return emptyRoom;
}
- μ¬κ· νΈμΆμ ν΅ν΄ λΉ λ°©μ μ°Ύμ
roomMapμ κ°±μ ν΄μ€λ€. - μ΄λ₯Ό ν΅ν΄ ν λ²μ λΉ λ°©μ λ°°μ ν΄μ€ μ μλ€.
π CODE
μ½λ 보기/μ κΈ°π«
import java.util.*;
class Solution {
Map<Long, Long> roomMap = new HashMap<>();
public long[] solution(long k, long[] room_number) {
long[] answer = new long[room_number.length];
for (int i = 0; i < room_number.length; i++)
answer[i] = getRoom(room_number[i]);
return answer;
}
private long getRoom(long room) {
// ν΄λΉ λ°©μ΄ μμ§ λ°°μ λ°μ§ μμ κ²½μ°
if (!roomMap.containsKey(room)) {
roomMap.put(room, room + 1);
return room;
}
// ν΄λΉ λ°©μ΄ μ΄λ―Έ λ°°μ λ κ²½μ°, μ¬κ· νΈμΆμ ν΅ν΄ λΉ λ°©μ μ°Ύλλ€.
long emptyRoom = getRoom(roomMap.get(room));
roomMap.put(room, emptyRoom);
return emptyRoom;
}
}
βοΈ Review
Mapμ μ¬μ©ν΄ λ°© λ²νΈμ λ°°μ κ°λ₯ν λ°© λ²νΈλ₯Ό μ μ₯νμ¬ λ κ°μ΄ κ°μμ§ λκΉμ§ νμνλ©΄μ λ°°μ κ°λ₯ν λ°©μ λ°°μ ν΄μ£Όλ λ°©μμΌλ‘ ꡬννμμ§λ§, μκ°μ΄κ³Όκ° λ°μνλ€.- λ¨μΆμ μν΄μλ
1 -> 2 -> 3 -> 4 -> 5κ° μλλΌ1 -> 5λ‘ λ°© λ°°μ μ λ°λ‘ λ°μ μ μλλ‘ ν΄μ£Όμ΄μΌ νλ€.